Tractable near-optimal policies for crawling
نویسندگان
چکیده
منابع مشابه
Near-optimal policies for broadcasting files with unequal sizes∗
Information broadcasting is an effective method to deliver popular files to a large number of users in wireless and satellite networks. In a previous work, we used a dynamic optimization approach to address the problem of broadcast scheduling for a pull system with equal file sizes. In this paper, we address that problem in a more general setting where the file sizes are not equal and have geom...
متن کاملTractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of activities to schedule, sequence them, and decide how much time they are allowed, in such a way that temporal and resource constraints are satisfied and overall schedule quality is maximized. While most such problems are...
متن کاملOptimal and near-optimal inventory control policies for a make-to-order inventory-production system
This paper examines several inventory replenishment policies for a make-to-order inventory–production system that consists of a production workshop and a warehouse. Demands arrive to the production workshop according to a Poisson process, and are processed in an FCFS manner. The production workshop requires that the warehouse provides, as needed, raw materials for use in the production process....
متن کاملOptimal and Near-Optimal ( s, S) Inventory Policies for Levy Demand Processes
A is a continuous-time, real-valued stochastic process which has independent and Levy jump process stationary increments, with no Brownian component. We study some of the fundamental properties of Levy jump processes and develop inventory models for them. Of particular interest to us is the gamma-distributed Levy process, in which the demand that occurs in a fixed period of time has a gamma dis...
متن کاملComputing Near-Optimal Policies in Generalized Joint Replenishment
We provide a practical methodology for solving the generalized joint replenishment (GJR) problem, based on a mathematical programming approach to approximate dynamic programming. We show how to automatically generate a value function approximation basis built upon piecewise-linear ridge functions, by developing and exploiting a theoretical connection with the problem of finding optimal cyclic s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2018
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1801519115